Verifying Process Algebra Proofs in Type Theory
نویسنده
چکیده
In this paper we study automatic veri cation of proofs in process algebra Formulas of process algebra are represented by types in typed calculus Inhabitants terms of these types represent proofs The speci c typed calculus we use is the Calculus of Inductive Constructions as implemented in the interactive proof construction program COQ
منابع مشابه
A History of Selected Topics in Categorical Algebra I: From Galois Theory to Abstract Commutators and Internal Groupoids
This paper is a chronological survey, with no proofs, of a direction in categorical algebra, which is based on categorical Galois theory and involves generalized central extensions, commutators, and internal groupoids in Barr exact Mal’tsev and more general categories. Galois theory proposes a notion of central extension, and motivates the study of internal groupoids, which is then used as an a...
متن کاملA Process Algebra for Instruction - Set Architecture Design ?
Process algebras are suitable for modeling a wide variety of sequential and concurrent systems. They are used for modeling both hardware and software. This paper presents a process algebra (IspCal) designed for modeling and verifying synchronous digital systems at the register-transfer and instruction-set levels. It can be used for reasoning about the behavior of concurrent state machines or ha...
متن کاملVerifying and Invalidating Textbook Proofs Using Scunak
Many textbook proofs are essentially human-readable representations of natural deduction proofs. Terms in dependent type theory provide formally checkable representations of natural deduction proofs. We show how the new mathematical assistant system Scunak can be used to verify a textbook proof by translating the LTEX version into a proof term in a dependent type theory. We also show how Scunak...
متن کامل2 Proof Checkers and Concurrency
We provide a treatise about checking proofs of distributed systems by computer using general purpose proof checkers. In particular, we present two approaches to verifying and checking the veri cation of the Sequential Line Interface Protocol (SLIP), one using rewriting techniques and one using the so-called cones and foci theorem. Both veri cations are carried out in the setting of process alge...
متن کاملRoland Backhouse : Relational Theory of Data Types 5 David Basin : Program Synthesis as Higher Order Resolution
Introduction 4 Roland Backhouse: Relational Theory of Data Types 5 David Basin: Program Synthesis as Higher Order Resolution 6 Bettina Buth: Verification Support for Compiler Development 7 Debora Weber-Wulff: Growing Programs from Proofs 8 Jacques Loeckx (with M. Wolf): Constructive versus axiomatic and initial specifications 9 Friederike Nickl: An Algebraic/Axiomatic Interpretation of Data Flo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993